Most binary matrices have no small defining set
نویسندگان
چکیده
منابع مشابه
Binary set functions and parity check matrices
We consider the possibility of extending to a family of sets a binary set function defined on a subfamily so that the extension is, in fact, uniquely determined. We place in this context the problem of finding the least integer n(r) such that every linear code of length n with n B n(r), dimension n r and minimum Hamming distance at least 4 has a parity check matrix composed entirely of odd weig...
متن کاملFactor-set of binary matrices and Fibonacci numbers
The article discusses the set of square n n binary matrices with the same number of 1’s in each row and each column. An equivalence relation on this set is introduced. Each binary matrix is represented using ordered n-tuples of natural numbers. We are looking for a formula which calculates the number of elements of each factor-set by the introduced equivalence relation. We show a relationship b...
متن کاملBinary Moore-Penrose Inverses of Set Inclusion Incidence Matrices
This note is a supplement to some recent work of R.B. Bapat on Moore-Penrose inverses of set inclusion matrices. Among other things Bapat constructs these inverses (in case of existence) forH(s, k) mod p, p an arbitrary prime, 0 ≤ s ≤ k ≤ v − s. Here we restrict ourselves to p = 2. We give conditions for s, k which are easy to state and which ensure that the Moore-Penrose inverse of H(s, k) mod...
متن کاملAlmost All Integer Matrices Have No Integer Eigenvalues
In a recent issue of this MONTHLY, Hetzel, Liew, and Morrison [4] pose a rather natural question: what is the probability that a random n× n integer matrix is diagonalizable over the field of rational numbers? Since there is no uniform probability distribution on Z, we need to exercise some care in interpreting this question. Specifically, for an integer k ≥ 1, let Ik = {−k,−k + 1, . . . , k − ...
متن کاملFor most graphs H, most H-free graphs have a linear homogeneous set
Erdős and Hajnal conjectured that for every graph H there is a constant ε = ε(H) > 0 such that every graph G that does not have H as an induced subgraph contains a clique or a stable set of order Ω(|V (G)|ε). The conjecture would be false if we set ε = 1; however, in an asymptotic setting, we obtain this strengthened form of Erdős and Hajnal’s conjecture for almost every graph H, and in particu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2020.112035